The asymptotic variance of departures in critically loaded queues
نویسندگان
چکیده
منابع مشابه
The asymptotic variance of departures in critically loaded queues
We consider the asymptotic variance of the departure counting processD(t) of the GI/G/1 queue;D(t) denotes the number of departures up to time t. We focus on the case that the system load % equals 1, and prove that the asymptotic variance rate satisfies lim t→∞ VarD(t) t = λ ( 1− 2 π )( ca + c 2 s ) , where λ is the arrival rate and ca, cs are squared coefficients of variation of the inter-arri...
متن کاملDepartures from Many Queues in Series
We consider a series of n single-server queues, each with unlimited waiting space and the first-in first-out service discipline. Initially, the system is empty; then k customers are placed in the first queue. The service times of all the customers at all the queues are i.i.d. with a general distribution. We are interested in the time D(k, n) required for all k customers to complete service from...
متن کاملCritically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations
In this paper, we consider time-varying multi-server queues with abandonment and retrials. For their performance analysis, fluid and diffusion limits utilizing strong approximations have been widely used in the literature. Although those limits are asymptotically exact, they may not accurately approximate performance of multi-server queues even if the number of servers is large. To address that...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملThe asymptotic variance rate of the output process of finite capacity birth-death queues
We analyze the output process of finite capacity birth-death Markovian queues. We develop a formula for the asymptotic variance rate of the form λ∗ + ∑ vi where λ ∗ is the rate of outputs and vi are functions of the birth and death rates. We show that if the birth rates are non-increasing and the death rates are non-decreasing (as is common in many queueing systems) then the values of vi are st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2011
ISSN: 0001-8678,1475-6064
DOI: 10.1239/aap/1300198521